class Solution {
public:

    int jumpFloor(int number) {
        int dp[number],i;
        dp[0]=1;
        dp[1]=1;
        dp[2]=2;
        if(number==1)
            return dp[1];
        if(number==2)
            return dp[2];
        for( i=3;i<=number;i++)
        {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[number];
    }
};